- modulo two sum
- мат.сумма по модулю два
English-Russian scientific dictionary. 2008.
modulo two sum
Смотреть что такое "modulo two sum" в других словарях:
Two's complement — The two s complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2 N for an N bit two s complement).A two s complement system or two s complement arithmetic is a… … Wikipedia
Proofs of Fermat's theorem on sums of two squares — Fermat s theorem on sums of two squares asserts that an odd prime number p can be expressed as: p = x^2 + y^2with integer x and y if and only if p is congruent to 1 (mod 4). The statement was announced by Fermat in 1640, but he supplied no proof … Wikipedia
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Fermat's theorem on sums of two squares — In number theory, Pierre de Fermat s theorem on sums of two squares states that an odd prime p is expressible as:p = x^2 + y^2,,with x and y integers, if and only if:p equiv 1 pmod{4}.The theorem is also known as Thue s Lemma, after Axel Thue.For … Wikipedia
Kummer sum — In mathematics, Kummer sum is the name given to certain cubic Gauss sums for a prime modulus p , with p congruent to 1 modulo 3. They are named after Ernst Kummer, who made a conjecture about the statistical properties of their arguments, as… … Wikipedia
Quadratic Gauss sum — For the general type of Gauss sums see Gaussian period, Gauss sumIn mathematics, quadratic Gauss sums are certain sums over exponential functions with quadratic argument. They are named after Carl Friedrich Gauss, who studied them… … Wikipedia
Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… … Wikipedia
Exponential sum — In mathematics, an exponential sum may be a finite Fourier series (i.e. a trigonometric polynomial), or other finite sum formed using the exponential function, usually expressed by means of the function:e(x) = exp(2pi ix).Therefore a typical… … Wikipedia
Mathematics of CRC — Cyclic Redundancy Check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around … Wikipedia
Low-density parity-check code — In information theory, a low density parity check code (LDPC code) is an error correcting code, a method of transmitting a message over a noisy transmission channel. [David J.C. MacKay (2003) Information theory, inference and learning algorithms … Wikipedia
Hex dump — is a hexadecimal view (on screen or a printout) of computer memory. Each byte (8 bits) is represented as a two digit hexadecimal number. Hex dumps are commonly organized into rows of 8 or 16 bytes, sometimes separated by whitespaces. Some hex… … Wikipedia
